Abstract Interpretation Based Verification of Logic Programs
نویسندگان
چکیده
منابع مشابه
Abstract Interpretation based Verification of Logic Programs
Interpretation based Verification of Logic Programs Marco Comini, Roberta Gori, Giorgio Levi, Paolo Volpe Dipartimento di Informatica Università di Pisa Pisa, Italy
متن کاملVerification of C Programs Via Natural Semantics and Abstract Interpretation
semantics. Following the abstract interpretation approach, we also require an abstract semantics that has a correlation with the concrete semantics. In addition, we require that appropriate abstract domains are available that can provide correct approximations for the values and all the operations that are involved in the concrete computation [9–12]. For CPM we have formally defined in [2] an a...
متن کاملTowards a Framework for the Abstract Interpretation of Logic Programs
A general and intuitively appealing framework is developed for the abstract interpretation of logic programs. An algorithm is given to build an abstract AND/OR tree. The algorithm uses a small set of primitive operations. Conditions for the primitive operations and the abstract domain guaranteeing termination of the algorithm and correctness of the abstract AND/OR tree are proved. The elegance ...
متن کاملAbstract Interpretation of Logic Programs using Magic Transformations
Interpretation of Logic Programs Using Magic Transformations Saumya Debray Department of Computer Science, University of Arizona-Tucson, AZ 85721, U.S.A. Raghu Ramakrishnan Department of Computer Sciences, University of Wisconsin-Madison, WI 53706, U.S.A. Abstract In data ow analysis of logic programs, information must be propagated according to the control strategy of the language under consid...
متن کاملEfficient Bottom-Up Execution of Logic Programs Using Abstract Interpretation
B o t t o m u p evaluation of logic programs has recently at tracted much attention in the logic programming and the deductive database field. It is complete [7], and if the number of all possible facts is finite, it is guaranteed to terminate, while t op -down evaluation may not. B o t t o m u p evaluation, however, may be inefficient since it may generate many facts irrelevant to the query. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2001
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80052-0